Search results for "Equivalence relation"
showing 10 items of 27 documents
Upper and lower generalized factoraggregations based on fuzzy equivalence relation
2014
We develop the concept of a general factoraggre-gation operator introduced by the authors on the basis of an equivalence relation and applied in two recent papers for analysis of bilevel linear programming solving parameters. In the paper this concept is generalized by using a fuzzy equivalence relation instead of the crisp one. By using a left-continuous t-norm and its residuum we define and investigate two modifications of such generalized construction: upper and lower generalized factoraggregations. These generalized factoraggregations can be used for construction of extensional fuzzy sets.
An Overview on Algebraic Structures
2016
This chapter recaps and formalizes concepts used in the previous sections of this book. Furthermore, this chapter reorganizes and describes in depth the topics mentioned at the end of Chap. 1, i.e. a formal characterization of the abstract algebraic structures and their hierarchy. This chapter is thus a revisited summary of concepts previously introduced and used and provides the mathematical basis for the following chapters.
GEOMETRIC EQUIVALENCE OF ALGEBRAS
2001
In this paper, we study the geometric equivalence of algebras in several varieties of algebras. We solve some of the problems formulated in [2], in particular, that of geometric equivalence for real-closed fields and finitely generated commutative groups.
On Extensional Fuzzy Sets Generated by Factoraggregation
2014
We develop the concept of a general factoraggregation operator introduced by the authors on the basis of an equivalence relation and applied in two recent papers for analysis of bilevel linear programming solving parameters. In the paper this concept is generalized by using a fuzzy equivalence relation instead of the crisp one. We show how the generalized factoraggregation can be used for construction of extensional fuzzy sets and consider approximations of arbitrary fuzzy sets by extensional ones.
Weak associativity and restricted rotation
2009
A restricted rotation induced by a weak associative law is introduced. The corresponding equivalence relation is identical to the Glivenko congruence on Tamari lattices, i.e. lattices of binary trees endowed by the well-known rotation operation.
A space on which diameter-type packing measure is not Borel regular
1999
We construct a separable metric space on which 1-dimensional diameter-type packing measure is not Borel regular.
Lp-Spaces
1998
For (X, ℜ, μ) a positive measure space, it has already been noted that μ - a.e. equality is an equivalence relation, and the relation ≤ μ-a.e. a preorder, on.This section studies the structure of the equivalence classes into which μ-a,e. equality partitions.Since the set X/X( ℜ) is always u-null (2.7.7 a)), only the function values on the set X(ℜ) have any significance when equivalence classes are formed: whether we form equivalence classes by partitioning or by partitioningX(ℜ) the resulting structures will be isomorphic. Nevertheless, it is natural to allow functions on an arbitrary X ⊃ X(ℜ). Our choice is to form μ-equivalence classes by partitioning the set X(ℜ). For arbitrary X ⊃ X(ℜ),…
Aggregation of Risk Level Assessments Based on Fuzzy Equivalence Relation
2017
The paper deals with the problem of aggregation of risk level assessments. We describe the technique of a risk level evaluation taking into account values of the risk level obtained for objects which are in some sense equivalent. For this purpose we propose to use the construction of a general aggregation operator based on the corresponding fuzzy equivalence relation. Numerical example of the investment risk level aggregation using an equivalence relation obtained on the basis of different macroeconomic factors for countries of one region is considered.
Forbidden words in symbolic dynamics
2000
AbstractWe introduce an equivalence relation≃between functions from N to N. By describing a symbolic dynamical system in terms of forbidden words, we prove that the≃-equivalence class of the function that counts the minimal forbidden words of a system is a topological invariant of the system. We show that the new invariant is independent from previous ones, but it is not characteristic. In the case of sofic systems, we prove that the≃-equivalence of the corresponding functions is a decidable question. As a more special application, we show, by using the new invariant, that two systems associated to Sturmian words having “different slope” are not conjugate.
Combinatorics of Finite Words and Suffix Automata
2009
The suffix automaton of a finite word is the minimal deterministic automaton accepting the language of its suffixes. The states of the suffix automaton are the classes of an equivalence relation defined on the set of factors. We explore the relationship between the combinatorial properties of a finite word and the structural properties of its suffix automaton. We give formulas for expressing the total number of states and the total number of edges of the suffix automaton in terms of special factors of the word.